5-6-7 Meshes

نویسندگان

  • Nima Aghdaii
  • Hamid Younesy
  • Hao Zhang
چکیده

We introduce a new type of meshes called 5-6-7 meshes. For many mesh processing tasks, lowor high-valence vertices are undesirable. At the same time, it is not always possible to achieve complete vertex valence regularity, i.e., to only have valence-6 vertices. A 56-7 mesh is a closed triangle mesh where each vertex has valence 5, 6, or 7. An intriguing question is whether it is always possible to convert an arbitrary mesh into a 5-6-7 mesh. In this paper, we answer the question in the positive. We present a 5-6-7 remeshing algorithm which converts a closed triangle mesh with arbitrary genus into a 5-6-7 mesh which a) closely approximates the original mesh geometrically, e.g., in terms of feature preservation, and b) has a comparable vertex count as the original mesh. We demonstrate the results of our remeshing algorithm on meshes with sharp features and different topology and complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

5-6-7 Meshes: Remeshing and analysis

We introduce a new type of meshes called 5-6-7 meshes. For many mesh processing tasks, lowor high-valence vertices are undesirable. At the same time, it is not always possible to achieve complete vertex valence regularity, i.e., to only have valence-6 vertices. A 5-6-7 mesh is a closed triangle mesh where each vertex has valence 5, 6, or 7. An intriguing question is whether it is always possibl...

متن کامل

A Scalable and fault-Tolerant Architecture for Internet Multicasting Using Meshes

! " # $ %& ' () '%*#' $ + -,/.102 # 03. ' 4,5 ' (6 7 + ".8 9 % ':; < 6 9 ) $ = 6 " #' ' %& ( > :? ! @:4 A> 9 + B C ,5 ' (D,5 '% ' > %+ @ > 5 9 6 " %& 6 AE ) B F G( > :IH J! K: % F L 9CM 9 5 K B F & / # ' %& ' (L 4 G , ,5 9% % %N % K#' ' + ' O ' > %N. 0P, : #$ ' ( + + 4 '% +%K % -,Q R /( :D , ,5 9% % $ ( ST( > :! 9 ' 4,! 6 4 (> + -SU ,Q " # $:8 ' 1 2 9 > + " ' O $ =C $ V ( > :IHXWY CZ:5 #F '%6: ...

متن کامل

Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding

We present a simple linear time algorithm for decoding Edgebreaker encoded triangle meshes in a single traversal. The Edgebreaker encoding technique, introduced in [5], encodes the connectivity of triangle meshes homeomorphic to a sphere with a guaranteed 2 bits per triangle or less. The encoding algorithm visits every triangle of the mesh in a depthfirst order. The original decoding algorithm ...

متن کامل

Rate-Distortion Optimal Mesh Simplification for Communications

The thesis studies the optimization of a specific type of computer graphic representation: polygon-based, textured models. More precisely, we focus on meshes having 4-8 connectivity. We study a progressive and adaptive representation for textured 4-8 meshes suitable for transmission. Our results are valid for 4-8 meshes built from matrices of amplitudes, or given as approximations of a subdivis...

متن کامل

A discrete calculus analysis of the Keller Box scheme and a generalization of the method to arbitrary meshes

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 A Discrete Calculus Analysis of the Keller Box Scheme and a Generalization of the Method to Arbitrary Meshes. V. Subramanian and J. B. Perot

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012